Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, x) → a
f(g(x), y) → f(x, y)
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, x) → a
f(g(x), y) → f(x, y)
Q is empty.
We use [23] with the following order to prove termination.
Recursive path order with status [2].
Precedence:
f2 > a
Status:
trivial